Random linear recursions with dependent coefficients

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multivariate linear recursions with Markov-dependent coefficients

We study a linear recursion with random Markov-dependent coefficients. In a “regular variation in, regular variation out” setup we show that its stationary solution has a multivariate regularly varying distribution. This extends results previously established for i.i.d. coefficients.

متن کامل

One-dimensional linear recursions with Markov-dependent coefficients

For a class of stationary Markov-dependent sequences (ξn, ρn) ∈ R 2, we consider the random linear recursion Sn = ξn + ρnSn−1, n ∈ Z, and show that the distribution tail of its stationary solution has a power law decay. An application to random walks in random environments is discussed. MSC2000: primary 60K15 ; secondary 60K20, 60K37.

متن کامل

ONE-DIMENSIONAL LINEAR RECURSIONS WITH MARKOV-DEPENDENT COEFFICIENTS BY ALEXANDER ROITERSHTEIN University of British Columbia

with real-valued random coefficients An and Bn. If the sequence of random pairs (An,Bn)n∈Z is stationary and ergodic, E(log |B0|) < 0, and E(log |A0|+) < ∞, where x+ = max(0, x), then for any initial random value S0, the limit law of Sn is the same as that of the random variable R =A0 +∑∞n=1 A−n∏n−1 i=0 B−i , and it is the unique initial distribution under which (Sn)n≥0 is stationary (cf. [6])....

متن کامل

Linear Elliptic Difference Inequalities with Random Coefficients

We prove various pointwise estimates for solutions of linear elliptic difference inequalities with random coefficients. These estimates include discrete versions of the maximum principle of Aleksandrov and Harnack inequalities and Holder estimates of Krylov and Safonov for elliptic differential operators with bounded coefficients.

متن کامل

Random closed sets viewed as random recursions

It is known that the box dimension of any Martin-Löf random closed set of {0, 1}N is log2( 43 ). Barmpalias et al. [Journal of Logic and Computation, Vol. 17, No. 6 (2007)] gave one method of producing such random closed sets and then computed the box dimension, and posed several questions regarding other methods of construction. We outline a method using random recursive constructions for comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics & Probability Letters

سال: 2010

ISSN: 0167-7152

DOI: 10.1016/j.spl.2010.06.013